Polynomial maps and a conjecture of Samuelson

Proof of a Chromatic Polynomial Conjecture

In this paper, all graphs considered are simple graphs. We always suppose that G is a graph. Let V(G), E(G), v(G), and e(G) be the vertex set, edge set, order and number of edges of G. For a positive integer *, a *-colouring of G is a mapping f : V(G) [1, ..., *] such that f (x){ f ( y) whenever x and y are adjacent in G. Let P(G, *) denote the number of *-colourings in G. It is well known that...

a comparison of linguistic and pragmatic knowledge: a case of iranian learners of english

در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...

Polynomial maps with strongly nilpotent Jacobian matrix and the Jacobian Conjecture

Inversion of polynomial species and jacobian conjecture

We consider the following problem in the theory of (virtual) species of structures: Given a polynomial species F such that its derivative dF equals 1, will its inverse w.r.t substitution F h?1i also be polynomial species? We shall see that this is in general not the case. From this result it follows that an analogue of the jacobian conjecture in the context of species does not hold.

Intersections of Polynomial Orbits, and a Dynamical Mordell-lang Conjecture

We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a dynamical analogue of the MordellLang conjecture.